A note on potentially K1, 1, t-graphic sequences
نویسنده
چکیده
منابع مشابه
Degree sequence realizations with given packing and covering of spanning trees
Designing networks in which every processor has a given number of connections often leads to graphic degree sequence realization models. A nonincreasing sequence d = (d1, d2, . . . , dn) is graphic if there is a simple graphGwith degree sequence d. The spanning tree packing number of graphG, denoted by τ(G), is themaximumnumber of edge-disjoint spanning trees in G. The arboricity of graph G, de...
متن کاملOn the potentially Pk - graphic sequences 1 Jiong - Sheng
A nonincreasing sequence n of n nonnegative integers is said to be graphic if it is the degree sequence of a simple graph G of order n and G is called a realization of n. A graph G of order n is said to have property P, if it contains a clique of size k as a subgraph. An n-term graphic sequence n is said to be potentially (res. forcibly)Pk-graphic if it has a realization having (res. all its re...
متن کاملOn potentially P-graphic degree sequences
A sequence 1l = (d 1 ,d 2 , ... ,d n) of positive integers is said to be graphic if there exists a simple graph G such that 1£ is the degree sequence of G. For a specified property P of graphs. a sequence 1l = (d 1 ,d 2 • ... • d n) of positive integers is said to be potentially P-graphic if 1l is graphic and there exists a realization of 1l with the property P. In this paper we characterize po...
متن کامل. C O ] 1 0 Ja n 20 09 A Characterization On Potentially K 2 , 5 - graphic Sequences ∗
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km −H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize the potentially K2,5-graphic sequences. This characterization implies a theorem due to Yin et al. [15].
متن کامل1 0 Ja n 20 09 A Characterization On Potentially K 6 − C 4 - graphic Sequences ∗
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km −H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize the potentially K6 − C4-graphic sequences. This characterization implies a theorem due to Hu and Lai [7].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 37 شماره
صفحات -
تاریخ انتشار 2007